Polynomials and Sums of Squares Sabine Burgdorf
نویسنده
چکیده
In recent years, much work has been devoted to a systematic study of polynomial identities certifying strict or non-strict positivity of a polynomial f on a basic closed set K ⊂ R. The interest in such identities originates not least from their importance in polynomial optimization. The majority of the important results requires the archimedean condition, which implies that K has to be compact. This paper introduces the technique of pure states into commutative algebra. We show that this technique allows an approach to most of the recent archimedean Stellensätze that is considerably easier and more conceptual than the previous proofs. In particular, we reprove and strengthen some of the most important results from the last years. In addition, we establish several such results which are entirely new. They are the first that allow f to have arbitrary, not necessarily discrete, zeros in K.
منابع مشابه
Algorithmic aspects of sums of hermitian squares
This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allows us to use semidefinite programming. For rational polynomials num...
متن کاملAlgorithmic aspects of sums of Hermitian squares of noncommutative polynomials
This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allows us to use semidefinite programming. Throughout the paper several...
متن کاملSums of Hermitian Squares as an Approach to the Bmv Conjecture
Lieb and Seiringer stated in their reformulation of the BessisMoussa-Villani conjecture that all coefficients of the polynomial p(t) = tr[(A+ B)] are nonnegative whenever A and B are any two positive semidefinite matrices of the same size. We will show that for all m ∈ N the coefficient of t in p(t) is nonnegative, using a connection to sums of Hermitian squares of non-commutative polynomials w...
متن کاملCorrection of a Proof in ”connes’ Embedding Conjecture and Sums of Hermitian Squares”
We show that Connes’ embedding conjecture (CEC) is equivalent to a real version of the same (RCEC). Moreover, we show that RCEC is equivalent to a real, purely algebraic statement concerning trace positive polynomials. This purely algebraic reformulation of CEC had previously been given in both a real and a complex version in a paper of the last two authors. The second author discovered a gap i...
متن کاملThe tracial moment problem and trace-optimization of polynomials
The main topic addressed in this paper is trace-optimization of polynomials in noncommuting (nc) variables: given an nc polynomial f , what is the smallest trace f(A) can attain for a tuple of matrices A? A relaxation using semidefinite programming (SDP) based on sums of hermitian squares and commutators is proposed. While this relaxation is not always exact, it gives effectively computable bou...
متن کاملTrace-positive polynomials and the quartic tracial moment problem Polynômes avec une trace positive et le problème quartique des moments traciaux
The tracial analog of Hilbert’s classical result on positive binary quartics is presented: a trace-positive bivariate noncommutative polynomial of degree at most four is a sum of hermitian squares and commutators. This is applied via duality to investigate the truncated tracial moment problem: a sequence of real numbers indexed by words of degree four in two noncommuting variables with values i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009